Refinement Rules for Real-Time Multi-tasking Programs
نویسنده
چکیده
We present several formal program refinement rules for designing multi-tasking programs with hard real-time constraints.
منابع مشابه
Integrating Real-Time Scheduling Theory and Program Refinement
Abs t rac t . We show how real-time schedulability tests and program refinement rules can be integrated to create a formal development method of practical use to real-time programmers. A computational model for representing task scheduling is developed within a 'timed' refinement calculus. Proven multi-tasking schedulability tests then become available as feasibility checks during system refine...
متن کاملMulti-tasking control system for real-time processing of biomedical signals.
A general multi-tasking control system has been developed for real-time signal processing. This control system, written in the language PASCAL, enables tasks (expressed as PASCAL procedures) to be performed as separate, concurrent processes, with adjustable priority levels. Modifications of this system such as the addition of new processes and a change of the number of priority levels can be re...
متن کاملThe Fifth International Workshop on Software Support for Portable Storage
NAND flash memory has been widely used as a nonvolatile storage for data. However, it does not support byte-level random access and hence directly executing program codes from NAND flash memory is not possible. Thus, we have to use RAM as working storage for preloading the program codes and executing them from RAM. This approach, however, requires a large amount of expensive RAM as the program ...
متن کاملModelling Real-time Multi-tasking Systems with Timed Traces Note: Most Svrc Technical Reports Are Available Modelling Real-time Multi-tasking Systems with Timed Traces
We formalise the behaviour of non-preemptive, real-time, multi-tasking systems by expressing the computational components assumed by real-time scheduling theory in a trace-based notation. The model is suitable as a target implementation domain for dataaow reenements, amenable to formal schedulability analysis, and implementable in a concurrent real-time programming language.
متن کاملScalable Multi-Tasking using Preemption Thresholds
Preemptive multi-tasking is a commonly used architecture for designing and implementing embedded real-time software. However, preemptive multi-tasking comes with its own costs. These costs include overheads due to preemptions and context-switches that result in waste of CPU bandwidth. Also, each task incurs a memory cost largely due to the need to maintain a separate stack for each task. These ...
متن کامل